SERIMI: Class-Based Matching for Instance Matching Across Heterogeneous Datasets
نویسندگان
چکیده
منابع مشابه
SERIMI: Class-based Disambiguation for Effective Instance Matching over Heterogeneous Web Data
Instance matching has been studied with focus on the singledomain setting, while less attention is given to the heterogeneous environment of the Web, where data comes from different domains and are associated with different schemas. For this heterogeneous setting, we propose an unsupervised schema-agnostic approach that focuses on the refinement (disambiguation) of candidate instances (resultin...
متن کاملSERIMI - resource description similarity, RDF instance matching and interlinking
Abstract. This paper presents SERIMI, an automatic approach for solving the interlinking problem over RDF data. SERIMI matches instances between a source and a target datasets, without prior knowledge of the data, domain or schema of these datasets. Experiments conducted with benchmark collections demonstrate that our approach considerably outperforms state-of-the-art automatic approaches for s...
متن کاملEffective Instance Matching for Heterogeneous Structured Data
Structured data is abundantly available in enterprises and also largely increasing in the Web setting. Generally speaking, it can be conceived as structured descriptions of real-world entities. One main problem towards the effective usage of structured data is instance matching, where the goal is to find instance representations referring to the same real-world thing. However, the structured da...
متن کاملEntity Matching across Heterogeneous Sources
Given an entity in a source domain, finding its matched entities from another (target) domain is an important task in many applications. Traditionally, the problem was usually addressed by first extracting major keywords corresponding to the source entity and then query relevant entities from the target domain using those keywords. However, the method would inevitably fails if the two domains h...
متن کاملInstance-Based OWL Schema Matching
Schema matching is a fundamental issue in many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instancebased or semantic, is to detect how the same real world objects are represented in different database...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2015
ISSN: 1041-4347
DOI: 10.1109/tkde.2014.2365779